Towards a Wz Evolution of the Mehta Integral * Doron Zeilberger ?

نویسنده

  • W. BECKNER
چکیده

The celebrated Mehta integral is shown to be equivalent to a simple algebraic-differential identity, which is completely routine for any fixed number of variables. Askey [As] proposed the problem of proving the Mehta (see [M]) integral identity (Mehta) 2 1 exp(-x/2 xnl2 H (xi-xj)2Cdxl""dan-H (cj)! without using Selberg's integral (see [M]). This problem was solved by Anderson [An]. Here we use the method of [WZ1] and[WZ2] to initiate another Selberg-free proof that we believe is of independent interest. We show that (Mehta) for any given n is equivalent to the following elegant identity (d := n(n-1)/2): (Mehta') 0 2 1 0 0 li<jSn 15i<jn H ls<rn (Mehta) is purely routine for any specific n, but at the time of writing we are unable to prove it directly for general n. Of course, we do have a proof, since we e going to show that (Mehta) and (Mehta) e equivalent, but what we are aer is a direct proof. The author is offering a prize of 25 US dollars for such a proof. The present method also obviously extends to the Macdonald-Mehta inteal [M], which w proved by neckner d Regev [BR] for the clsical root systems (see [M]), by Gvan [G] for the exceptional root system Fa, and by Opdam [O] for E6, ET, and Es. It follows that the present approh should also yield new proofs for all the exceptional root systems, at let in principle, but most likely in practice also. More important, it seems to have a high chance of producing a uniform, intrinsic, clsification-independent proof. We leave to the reader, an instructive exercise, the tk of finding the root-system analog of (Mehta) that is equivalent to the now-proved Mehta-Macdonald conjecture, and we offer an additional 25 dollars for an intrinsic proof. Our proposed proof of (Mehta) will be a de,ration rather than a vefication, and will follow the method of [WZ2]. Let us call the len of (Mehta) i(c), and the inteand F(c; x,..., xn). We know from the general theory of [WZ2] that for some r

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multi-Variable Zeilberger and Almkvist-Zeilberger Algorithms and the Sharpening of Wilf-Zeilberger Theory

Superficially, this article, dedicated with friendship and admiration to Amitai Regev, has nothing to do with either Polynomial Identity Rings, Representation Theory, or Young tableaux, to all of which he made so many outstanding contributions. But anyone who knows even a little about Amitai Regev’s remarkable and versatile research, would know that both sums (and multi-sums!), and especially i...

متن کامل

Deconstructing the Zeilberger algorithm

By looking under the hood of Zeilberger’s algorithm, as simplified by Mohammed and Zeilberger, it is shown that all the classical hypergeometric closed-form evaluations can be discovered ab initio, as well as many “strange” ones of Gosper, Maier, and Gessel and Stanton. The accompanying Maple package FindHypergeometric explains the various miracles that account for the classical evaluations, an...

متن کامل

An algorithmic proof theory for hypergeometric (ordinary and <Emphasis Type="Italic">q </Emphasis>) multisum/integral identities

It is shown that every 'proper-hypergeometric ' multisum/integral identity, or q-identity, with a fixed number of summations and/or integration signs, possesses a short, computer-constructible proof. We give a fast algorithm for finding such proofs. Most of the identities that involve the classical special functions of mathematical physics are readily reducible to the kind of identities treated...

متن کامل

RATIONAL FUNCTION CERTIFICATION OF MULTISUM / INTEGRAL / “ q ” IDENTITIES

The method of rational function certification for proving terminating hypergeometric identities is extended from single sums or integrals to multi-integral/sums and “q” integral/sums.

متن کامل

The Markov-WZ Method

Andrei Markov’s 1890 method for convergence-acceleration of series bears an amazing resemblance to WZ theory, as was recently pointed out by M. Kondratieva and S. Sadov. But Markov did not have Gosper and Zeilberger’s algorithms, and even if he did, he wouldn’t have had a computer to run them on. Nevertheless, his beautiful ad-hoc method, when coupled with WZ theory and Gosper’s algorithm, lead...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994